Even Cycles and Even 2-Factors in the Line Graph of a Simple Graph
نویسندگان
چکیده
منابع مشابه
Even Cycles and Even 2-Factors in the Line Graph of a Simple Graph
Let G be a connected graph with an even number of edges. We show that if the subgraph of G induced by the vertices of odd degree has a perfect matching, then the line graph of G has a 2-factor whose connected components are cycles of even length (an even 2-factor). For a cubic graph G, we also give a necessary and sufficient condition so that the corresponding line graph L(G) has an even cycle ...
متن کاملNon-separating 2-factors of an even-regular graph
For a 2-factor F of a connected graph G, we consider G − F , which is the graph obtained from G by removing all the edges of F . If G − F is connected, F is said to be a non-separating 2-factor. In this paper we study a sufficient condition for a 2r -regular connected graph G to have such a 2-factor. As a result, we show that a 2r -regular connected graph G has a non-separating 2-factor wheneve...
متن کاملEven edge colorings of a graph
It is shown that the minimum number of colors needed to paint the edges of a graph G so that in every cycle of G there is a nonzero even number of edges of at least one color is rlog,X(G)l. For a simple graph G, let E(G) denote the minimum number 1 for which there exists a partition of E(G) into 1 subsets Ej, 1 d id 1, satisfying for any cycle Z of G, 0 < [E(Z) n Eil= 0 (mod 2) for at least one...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملConnected Even Factors in the Square of Essentially 2-Edge-connected Graph
An essentially k-edge connected graph G is a connected graph such that deleting less than k edges from G cannot result in two nontrivial components. In this paper we prove that if an essentially 2-edge-connected graph G satisfies that for any pair of leaves at distance 4 in G there exists another leaf of G that has distance 2 to one of them, then the square G2 has a connected even factor with m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/5660